On a disparity between relative cliquewidth and relative NLC-width
نویسندگان
چکیده
منابع مشابه
On a disparity between relative cliquewidth and relative NLC-width
Cliquewidth and NLC-width are two closely related parameters that measure the complexity of graphs. Both cliqueand NLC-width are defined to be the minimum number of labels required to create a labelled graph by certain terms of operations. Many hard problems on graphs become solvable in polynomial-time if the inputs are restricted to graphs of bounded cliqueorNLC-width. Cliquewidth andNLC-width...
متن کاملOn a Disparity Between Relative Cliquewidth and Relative NLC - width by Haiko Müller & Ruth Urner December 2008
Cliquewidth and NLC-width are two closely related parameters that measure the complexity of graphs. Both cliqueand NLC-width are defined to be the minimum number of labels required to create a labelled graph by certain terms of operations. Many hard problems on graphs become solvable in polynomial time if the inputs are restricted to graphs of bounded cliqueor NLC-width. Cliquewidth and NLC-wid...
متن کاملOn switching classes, NLC-width, cliquewidth and treewidth
In this paper we consider a connection between switching (of undirected graphs), and the notions of NLC-width, cliquewidth and treewidth. In particular, we show that the NLC-widths and the cliquewidths of two graphs in a switching class are at most a constant factor apart (2 for the former, 4 for the latter). A similar result can be shown not to hold for treewidth: it is easy to find a switchin...
متن کاملSpatial interactions minimize relative disparity between adjacent surfaces
Computational models of stereopsis employ a number of algorithms that constrain stereo matches to produce the smallest absolute disparity and to minimize the relative disparity between nearby features. In some natural scenes, such as large slanted textured surfaces, these two constraints lead to different matching solutions. The current study utilized a stimulus in which there was a large discr...
متن کاملComparing the Relative Volume with the Relative Inradius and the Relative Width
We consider subdivisions of a convex bodyG in two subsets E andG \E. We obtain several inequalities comparing the relative volume: (1) with the minimum relative inradius, (2) with the maximum relative inradius, (3) with the minimum relative width, and (4) with the maximum relative width. In each case, we obtain the best upper and lower estimates for subdivisions determined by general hypersurfa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.06.024